general randic matrix and general randic energy

Authors

ran gu

fei huang

xueliang li

abstract

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and $d_i$ the degree of its vertex $v_i$, $i = 1, 2,cdots, n$. inspired by the randi'c matrix and the general randi'cindex of a graph, we introduce the concept of general randi'cmatrix $textbf{r}_alpha$ of $g$, which is defined by$(textbf{r}_alpha)_{i,j}=(d_id_j)^alpha$ if $v_i$ and $v_j$ areadjacent, and zero otherwise. similarly, the general randi'{c}eigenvalues are the eigenvalues of the general randi'{c} matrix,the greatest general randi'{c} eigenvalue is the general randi'{c}spectral radius of $g$, and the general randi'{c} energy is the sumof the absolute values of the general randi'{c} eigenvalues. inthis paper, we prove some properties of the general randi'c matrixand obtain lower and upper bounds for general randi'{c} energy,also, we get some lower bounds for general randi'{c} spectralradius of a connected graph. moreover, we give a new sharp upperbound for the general randi'{c} energy when $alpha=-1/2$.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Conjugated trees with minimum general Randic index

The general Randić index Rα(G) is the sum of the weights (dG(u)dG(v)) over all edges uv of a (molecular) graph G, where α is a real number and dG(u) is the degree of the vertex u of G. In this paper, for any real number α ≤ −1, the minimum general Randić index Rα(T ) among all the conjugated trees (trees with a Kekulé structure) is determined and the corresponding extremal conjugated trees are ...

full text

Randic ordering of chemical trees

We introduce a partial order on the collection of chemical trees based on tree transformations. This partial order is tightly related to the Randić connectivity index χ. Its analysis provides new structural information about the behavior of χ. As an illustration of the approach presented, we give a different and more structural view of some known results about the first values of χ on the colle...

full text

Randic Structure of a Graph

Let G be a collection of graphs with n vertices. We present a simple description of [G]χ = {H ∈ G : χ(H) = χ(G)} where χ denotes the Randić index. We associate to G a Q-linear map ρ : Qm → Qk (for some integers k, m depending on G) such that the kernel of ρ contains the necessary information to describe [G]χ in terms of linear equations. These results provide precise tools for analyzing the beh...

full text

randic incidence energy of graphs

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

full text

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

full text

Bounds for Randic and GA Indices

The paper establishes some new bounds for Randic and GA indices.

full text

My Resources

Save resource for easier access later


Journal title:
transactions on combinatorics

Publisher: university of isfahan

ISSN 2251-8657

volume 3

issue 3 2014

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023